Compressibility and Kolmogorov Complexity
نویسندگان
چکیده
We continue the investigation of the path-connected geometry on the Cantor space and the related notions of dilution and compressibility described in [1]. These ideas are closely related to the notions of effective Hausdorff and packing dimensions of reals, and we argue that this geometry provides the natural context in which to study them. In particular we show that every regular real can be maximally compressed that is every regular real is a dilution of some real of maximum effective Hausdorff dimension.
منابع مشابه
Relative Kolmogorov complexity and geometry
We use the connection of Hausdorff dimension and Kolmogorov complexity to describe a geometry on the Cantor set including concepts of angle, projections and scalar multiplication. A question related to compressibility is addressed using these geometrical ideas.
متن کاملOn Innnite Sequences (almost) as Easy As
It is known that innnite binary sequences of constant Kolmogorov complexity are exactly the recursive ones. Such a kind of statement no longer holds in the presence of resource bounds. Contrary to what intuition might suggest, there are sequences of constant, polynomial-time bounded Kolmogorov complexity that are not polynomial-time computable. This motivates the study of several resource-bound...
متن کاملKobayashi compressibility
Kobayashi [Kob81] introduced a uniform notion of compressibility of infinite binary sequences X in terms of relative Turing computations with sub-linear use of the oracle. Given f : N → N we say that X is f -compressible if there exists Y such that for each n we can uniformly compute X ↾n from oracle Y ↾ f (n). Kobayashi compressibility has remained a relatively obscure notion, with the excepti...
متن کاملComplexity-Matching Universal Signal Estimation in Compressed Sensing
We study the compressed sensing (CS) signal estimation problem where an input signal is measured via a linear matrix multiplication under additive noise. While this setup usually assumes sparsity or compressibility in the input signal during recovery, the signal structure that can be leveraged is often not known a priori. In this paper, we consider universal CS recovery, where the statistics of...
متن کاملSignal Recovery in Compressed Sensing via Universal Priors
We study the compressed sensing (CS) signal estimation problem where an input is measured via a linear matrix multiplication under additive noise. While this setup usually assumes sparsity or compressibility in the observed signal during recovery, the signal structure that can be leveraged is often not known a priori. In this paper, we consider universal CS recovery, where the statistics of a s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 54 شماره
صفحات -
تاریخ انتشار 2013